Security Frameworks for Pseudorandom Number Generators

نویسنده

  • JU-SUNG KANG
چکیده

In the cryptographic system a pseudorandom number generator is one of the basic primitives. We survey theoretically secure pseudorandom bit generators which are provably secure under certain reasonable number theoretic assumptions and some practical pseudorandom number generators based on assumptions about symmetric crypto-primitives. Recently, there was a noticeable result for the concrete security analysis of pseudorandom number generators used in practice. Thus we have a closer look on the Desai-HeviaYin’s security framework and consider the provable security for some practical pseudorandom number generators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MATHEMATICAL ENGINEERING TECHNICAL REPORTS A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators

In this paper, we specify a class of mathematical problems, which we refer to as “Function Density Problems” (FDPs, in short), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1), and constructions of provably secure pseudorandom generators (PRGs) with some enhanced security property introd...

متن کامل

A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators

In this paper, we specify a class of mathematical problems, which we refer to as “Function Density Problems” (FDPs, in short), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1), and constructions of provably secure pseudorandom generators (PRGs) with some enhanced security property introd...

متن کامل

State Recovery Attacks on Pseudorandom Generators

State recovery attacks comprise an important class of attacks on pseudorandom generators. In this paper we analyze resistance of pseudorandom generators against these attacks in terms of concrete security. We show that security of the BlumMicali pseudorandom generator against state recovery attacks is tightly related to the security of the corresponding one-way function. C. Wolf, S. Lucks, P.-W...

متن کامل

Pseudorandom bit Generators for Secure Broadcasting Systems

Pseudorandom bit generators play an essential role in high-security audio/video scrambling and addressing systems which allow pay-TV programs to be viewed only by authorized subscribers. This paper evaluated cryptographic strength of the bit generators proposed by the European Broadcast Unit and the Japan's Ministry of Posts and Telecommunications and some security weakness was found on the gen...

متن کامل

Sustainable Pseudo-random Number Generator

Barak and Halevi (BH) have proposed an efficient architecture for robust pseudorandom generators that ensure resilience in the presence of attackers with partial knowledge or partial controls of the generators’ entropy resources. The BH scheme is constructed from the Barak, Shaltiel and Tromer’s randomness extractor and its security is formalized in the simulation-based framework. The BH model ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005